Kinetic spanning trees for minimum-power routing in MANETs
نویسندگان
چکیده
A distributed kinetic spanning tree algorithm is proposed for routing in wireless mobile ad hoc networks. Assuming a piecewise linear motion model for the nodes, the sequence of shortest-path spanning trees is determined, valid until the time of the next node trajectory change. By computing the sequence of trees using one execution of the distributed routing algorithm, in contrast to computing the tree for a single time instant, the number of routing messages is substantially reduced. Moreover, the total power required to route through the trees as a function of time is also lower. Keywords–Kinetic spanning trees, Wireless ad hoc networks, MANET
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملGraph Theory Algorithms for Mobile Ad hoc Networksh
Various simulators (e.g., ns-2 and GloMoSim) are available to implement and study the behavior of the routing protocols for mobile ad hoc networks (MANETs). But, students and investigators who are new to this area often get perplexed in the complexity of these simulators and lose the focus in designing and analyzing the characteristics of the network and the protocol. Most of the time would be ...
متن کاملRestoring the Connectivity in K-Connected MANET When All Edge Disjoint Minimum Spanning Trees Fail
Due to random mobility of nodes in MANETs, the connectivity of the nodes in very sensitive environments become a serious issue and is subject to increased risk of damage. Sometimes a MANET suffers from the simultaneous failure of multiple multicast paths and gets partitioned into disjoint segments. In order to avoid poor performance of a multicast/ unicast routing protocol and to curb the adver...
متن کاملBenchmarks and Tradeoffs for Minimum Hop, Minimum Edge and Maximum Lifetime per Multicast Tree in Mobile Ad hoc Networks
The high-level contribution of this paper is to establish benchmarks for the minimum hop count per source-receiver path, minimum number of edges per tree and maximum tree lifetime for multicast routing in mobile ad hoc networks (MANETs) and explore the tradeoffs between these three metrics. Accordingly, we consider three categories of algorithms – Breadth First Search (for minimum hop trees), m...
متن کاملMinimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning trees of the ST network. The TSMST computation problem aims to identify a collection of distinct minimum spanning trees and their respective timesub-intervals under the constraint that the edge weight functions are piec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002